Repository navigation
Insertion sort: .NET 10 and a benchmark that copies its input per call - #2375
Merged
vladimir-pecanac-main merged 2 commits intoNov 11, 2026
Conversation
Both projects target net10.0 with BenchmarkDotNet 0.15.8, MSTest 4.5.2, Microsoft.NET.Test.Sdk 18.11.0 and coverlet.collector 10.1.0. The benchmark moves to its own InsertionSortBenchmarks class that copies a never-sorted source array into a working array on every call, so random and reversed rows no longer measure already-sorted data. The sort methods lose the benchmark-only arrayName parameter and now match the article. Tests use (expected, actual) order and a new data-driven test compares both versions with Array.Sort.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Moves csharp-algorithms/InsertionSort to net10.0 with BenchmarkDotNet 0.15.8, MSTest 4.5.2, Microsoft.NET.Test.Sdk 18.11.0 and coverlet.collector 10.1.0. The old benchmark sorted the same array instance on every call, so after the first call every row measured an already-sorted array; the new InsertionSortBenchmarks class copies a fresh source into a working array on each call, at sizes 100, 1,000 and 10,000 for random, sorted and reversed input. The sort methods drop the benchmark-only arrayName parameter so they match the article, the tests use (expected, actual) order, and a new data-driven test checks both versions against Array.Sort.